Logical analysis of data with decomposable structures
نویسندگان
چکیده
منابع مشابه
Logical Analysis of Data with Decomposable Structures
In such areas as knowledge discovery, data mining and logical analysis of data, methodologies to 0nd relations among attributes are considered important. In this paper, given a data set (T; F) where T ⊆ {0; 1}n denotes a set of positive examples and F ⊆ {0; 1}n denotes a set of negative examples, we propose a method to identify decomposable structures among the attributes of the data. We 0rst s...
متن کاملRecovering Logical Structures of Data
Many powerful parallelizing compiler techniques rely on the structures of data and code. Unfortunately, in many real applications, arrays do not have syntactic structures. In this paper, we show that logical data structures can be automatically recovered from the flat, one-dimensional arrays and accesses. We present a framework and algorithms for recovering the logical multi-dimensional data st...
متن کاملBeyond Logical Tree Structures for Data Replication Schemes beyond Logical Tree Structures for Data Replication Schemes
General Structured Voting is a general framework for a wide range of data replication and distributed mutual exclusion schemes. It allows an easy tailoring for speciic objects and environments in a homogeneous manner. In this paper we investigate the characteristics of a so-called voting structure used by General Structured Voting to derive sets of cooperating nodes. Such a set of cooperating n...
متن کاملLogical Analysis of Data
The main objective of this paper is to compare the classification accuracy provided large, comprehensive collections of patterns (rules) derived from archives of past observations, with that provided by small, comprehensible collections of patterns. This comparison is carried out here on the basis of an empirical study, using several publicly available datasets. The results of this study show t...
متن کاملLogical analysis of data: classification with justification
Learning from examples is a frequently arising challenge, with a large number of algorithmsproposed in the classification and data mining literature. The evaluation of the quality ofsuch algorithms is usually carried out ex post, on an experimental basis: their performanceis measured either by cross validation on benchmark data sets, or by clinical trials. None ofthese approache...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00413-3